Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation

نویسندگان

  • Nam Yul Yu
  • Guang Gong
چکیده

In an effort to search for a new binary two-level autocorrelation sequence, the decimation-Hadamard transform (DHT) based on special classes of known binary sequences with two-level autocorrelation is investigated. It is theoretically proved that some realizations of a binary generalized Gordon-Mills-Welch (GMW) sequence can be predicted from the structure of subfield factorization and the realization in its subfield. Furthermore, it is shown that the realization of any binary two-level autocorrelation sequence with respect to a quadratic residue (QR) sequence is either a QR sequence or the sequence itself.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences

A new method to study and search for two-level autocorrelation sequences for both binary and nonbinary cases is developed. This method iteratively applies two operations: decimation and the Hadamard transform based on general orthogonal functions, referred to as the decimation-Hadamard transform (DHT). The second iterative DHT can transform one class of such sequences into another inequivalent ...

متن کامل

New Ternary and Quaternary Sequences with Two-Level Autocorrelation

Pseudorandom sequences with good correlation properties are widely used in communications and cryptography. The search of new sequences with two-level autocorrelation has been a very interesting problem for decades. In 2002, Gong and Golomb proposed the iterative decimationHadamard transform (DHT) which is an useful tool to study two-level autocorrelation sequences. They showed that for all odd...

متن کامل

The Proof of Lin's Conjecture via the Decimation-Hadamard Transform

In 1998, Lin presented a conjecture on a class of ternary sequences with ideal 2-level autocorrelation in his Ph.D thesis. Those sequences have a very simple structure, i.e., their trace representation has two trace monomial terms. In this paper, we present a proof for the conjecture. The mathematical tools employed are the second-order multiplexing decimation-Hadamard transform, Stickelberger’...

متن کامل

Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation

In this correspondence, we present five new classes of binary sequences of period 2 1 with ideal autocorrelation. These sequences, which correspond to new cyclic Hadamard difference sets, were found by extensive computer search. Conjectures on the general construction of these sequences are formulated.

متن کامل

Hadamard transforms of three-term sequences

) ( ) ( 2 q q x x x Tr x f + + = and A = {ai} where ) ( i i f a α = . In reference [1], the sequence A is conjectured to have a two-level autocorrelation for all n > 1 and this conjecture has been verified for 23 3 ≤ ≤ n . In this note, we present an interesting formula for the Hadamard transform of the sequence A or, equivalently, for the function f(x). The Hadamard transform of f(x) is define...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005